2 research outputs found
Declarative Event-Based Workflow as Distributed Dynamic Condition Response Graphs
We present Dynamic Condition Response Graphs (DCR Graphs) as a declarative,
event-based process model inspired by the workflow language employed by our
industrial partner and conservatively generalizing prime event structures. A
dynamic condition response graph is a directed graph with nodes representing
the events that can happen and arrows representing four relations between
events: condition, response, include, and exclude. Distributed DCR Graphs is
then obtained by assigning roles to events and principals. We give a graphical
notation inspired by related work by van der Aalst et al. We exemplify the use
of distributed DCR Graphs on a simple workflow taken from a field study at a
Danish hospital, pointing out their flexibility compared to imperative workflow
models. Finally we provide a mapping from DCR Graphs to Buchi-automata.Comment: In Proceedings PLACES 2010, arXiv:1110.385
Logic Based Modeling and Analysis of Workflows
We propose Concurrent Transaction Logic (CT R) as the language for specifying, analyzing, and scheduling of workflows. We show that both local and global properties of workflows can be naturally represented as CT R formulas and reasoning can be done with the use of the proof theory and the semantics of this logic. We describe a transformation that leads to an efficient algorithm for scheduling workflows in the presence of global temporal constraints, which leads to decision procedures for dealing with several safety related properties such as whether every valid execution of the workflow satisfies a particular property or whether a workflow execution is consistent with some given global constraints on the ordering of events in a workflow. We also..